منابع مشابه
A note on Rooted Survivable Networks
The (undirected) Rooted Survivable Network Design (Rooted SND) problem is: given a complete graph on node set V with edge-costs, a root s ∈ V , and (node-)connectivity requirements {r(t) : t ∈ T ⊆ V }, find a minimum cost subgraph G that contains r(t) internally-disjoint st-paths for all t ∈ T . For large values of k = maxt∈T r(t) Rooted SND is at least as hard to approximate as Directed Steine...
متن کاملA note on the Survivable Network Design Problem
In this note we consider the survivable network design problem (SNDP) in undirected graphs. We make two contributions. The first is a new counting argument in the iterated rounding based 2-approximation for edge-connectivity SNDP (EC-SNDP) originally due to Jain [Jai01]. The second is to make some additional connections between hypergraphic version of SNDP (Hypergraph-SNDP) introduced in [ZNI03...
متن کاملDesigning Hierarchical Survivable Networks
As the computer, communication, and entertainment industries begin to integrate phone, cable, and video services and to invest in new technologies such as fiber optic cables, interruptions in service can cause considerable customer dissatisfaction and even be catastrophic. In this environment, network providers want to offer high levels of servicein both serviceability (e.g., high bandwidth) an...
متن کاملSurvivable Bluetooth location networks
In this paper, we analyze survivability issues of Bluetooth Location Networks (BLN) for location-aware or context-driven mobile networks, such as m-commerce environments or e-museums. We assume that, in any of those scenarios, there exist service servers that need to know user location in real-time, to send context-oriented information to user handhelds when necessary. The BLN transmits positio...
متن کاملRearrangement moves on rooted phylogenetic networks
Phylogenetic tree reconstruction is usually done by local search heuristics that explore the space of the possible tree topologies via simple rearrangements of their structure. Tree rearrangement heuristics have been used in combination with practically all optimization criteria in use, from maximum likelihood and parsimony to distance-based principles, and in a Bayesian context. Their basic co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2009
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2009.07.011